Fixed-parameter tractability and completeness II: On completeness for W[1]
نویسندگان
چکیده
منابع مشابه
Fixed Parameter Tractability and Completeness
For many fixed-parameter problems that are trivially solvable in polynomial-time, such as k-Dominating Set, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as k-Feedback Vertex Set, exhibit fixed-parameter tractability: for each fixed k the problem is solvable in time bounded by a polynomial of degree c, where c is a const...
متن کاملFixed-Parameter Tractability and Completeness II: On Completeness for W[1]
For many fixed-parameter problems that are trivially solvable in polynomial-time, such as kDOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as FEEDBACK VERTEX SET, exhibit fixed-parameter tractability: for each fixed k the problem is solvable in time bounded by a polynomial of degree c, where c is a constant...
متن کاملFixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues
We describe new results in parameterized complexity theory. In particular, we prove a number of concrete hardness results for W [P ], the top level of the hardness hierarchy introduced by Downey and Fellows in a series of earlier papers. We also study the parameterized complexity of analogues of PSPACE via certain natural problems concerning k-move games. Finally, we examine several aspects of ...
متن کاملFixed-Parameter Tractability and Completeness I: Basic Results
For many fixed-parameter problems that are trivially soluable in polynomial time, such as (k-)DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as (k-)FEEDBACK VERTEX SET, exhibit fixed-parameter tractability: for each fixed k the problem is soluable in time bounded by a polynomial of degree c, where c is a c...
متن کاملFixed-Parameter Tractability and Completeness III: Some Structural Aspects of the W Hierarchy
We analyse basic structural aspects of the reducibilities we use to describe fixed parameter tractability and intractability, in the model we introduced in earlier papers in this series. Results include separation and density, the latter for the strongest reducibility.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1995
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00097-3